Data structures and algorithms
Climbing Stairs
Climbing Stairs: You are climbing a staircase. It takes n steps to reach the top.
read more
Data structures and algorithms
Squares of a Sorted Array
Squares of a Sorted Array: Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.
read more
Data structures and algorithms
Implement Trie (Prefix Tree)
Implement Trie (Prefix Tree): A trie (pronounced as “try”) or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings.
read more
Data structures and algorithms
Minimum Size Subarray Sum
Minimum Size Subarray Sum: Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or equal to target.
read more
Data structures and algorithms
Permutation in String
Permutation in String: Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise.
read more
Data structures and algorithms
Pow(x, n)
Pow(x, n): Implement pow(x, n), which calculates x raised to the power n (i.
read moreAbout Me
After investing countless hours in courses, books, and guides, as well as honing my skills on LeetCode, we came to the realization that interview preparation can be an incredibly time-consuming process, not to mention the stress of actually passing the interviews.
Know More